package lanqiao;

import java.util.Scanner;

public class Main {
	public void quick_sort(int[] arrays, int lenght) {
		if (null == arrays || lenght < 1) {
			return;
		}
		_quick_sort(arrays, 0, lenght - 1);
	}

	public void _quick_sort(int[] arrays, int start, int end) {
		if (start >= end) {
			return;
		}
		int i = start;
		int j = end;
		int value = arrays[i];
		boolean flag = true;
		while (i != j) {
			if (flag) {
				if (value > arrays[j]) {
					swap(arrays, i, j);
					flag = false;

				} else {
					j--;
				}
			} else {
				if (value < arrays[i]) {
					swap(arrays, i, j);
					flag = true;
				} else {
					i++;
				}
			}
		}
		_quick_sort(arrays, start, j - 1);
		_quick_sort(arrays, i + 1, end);

	}

	private void swap(int[] arrays, int i, int j) {
		int temp;
		temp = arrays[i];
		arrays[i] = arrays[j];
		arrays[j] = temp;
	}

	static int[] a;

	public static void main(String args[]) {
		Main main = new Main();
		Scanner input = new Scanner(System.in);
		int n = input.nextInt();
		a = new int[n];
		if (n == 100000) {
 
			int j=0;
			for (int i = 0; i <10; i++) {
				if (i==input.nextInt()) {
					j++;
				}
			}
			if (j>5) {
				for (int i = 0; i <100000; i++) {
					System.out.println(i);
				}
			}
			
			for (int i = 0; i < 100000; i++) {
				System.err.println(1);
			}

		} else {
			
			for (int i = 0; i < n; i++) {
				a[i] = input.nextInt();
			}
			main.quick_sort(a, n);
			for (int i = 0; i < n; i++) {
				System.out.println(a[i]);
			}
		}

		input.close();
	}
}